COSMO: A dynamic programming algorithm for multicriteria codon optimization
نویسندگان
چکیده
منابع مشابه
SwiftLib: rapid degenerate-codon-library optimization through dynamic programming
Degenerate codon (DC) libraries efficiently address the experimental library-size limitations of directed evolution by focusing diversity toward the positions and toward the amino acids (AAs) that are most likely to generate hits; however, manually constructing DC libraries is challenging, error prone and time consuming. This paper provides a dynamic programming solution to the task of finding ...
متن کاملMulticriteria integer programming: A (hybrid) dynamic programming recursive approach
where C ~ = (ct . . . . . , cpn) t, a n = (atn, . . . , aun) t and k = (k~, k2, .. . , k~) denote vectors of integers, and v-max (vector maximization) is used to differentiate the solution f rom the common single object ive maximization. The solution to (MCILP) is a set of integer points, X ° ( b ) , called efficient, such that if x ° E X ° ( b ) , there does not exist any other feasible point,...
متن کاملMCS - A new algorithm for multicriteria optimisation in constraint programming
In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch & Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either ...
متن کاملA New Adaptive Algorithm for Convex Quadratic Multicriteria Optimization
We present a new adaptive algorithm for convex quadratic multicriteria optimization. The algorithm is able to adaptively refine the approximation to the set of efficient points by way of a warm-start interior-point scalarization approach. Numerical results show that this technique is faster than a standard method used for this problem.
متن کاملHybrid dynamic/quadratic programming algorithm for interconnecttree optimization
We present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing in this paper. Both wire widths and buffer sizes are chosen from user-defined discrete sets. Our algorithm integrates the quadratic programming approach for handling a wire branch into the dynamic programming (DP) framework. Our experimental results show that our hybrid d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Structural Biotechnology Journal
سال: 2020
ISSN: 2001-0370
DOI: 10.1016/j.csbj.2020.06.035